منابع مشابه
Constructing Maintainable Semantic Mappings in XQuery
Semantic mapping is one of the important components underlying the data sharing systems. As is known, constructing and maintaining such mappings both are necessary yet extremely hard processes. While many current works focus on seeking automatic techniques to solve such problems, the mapping itself is still left as an undecorated expression, and in practice it is still inevitable for the user t...
متن کاملConvergence Theorems for Nonexpansive Mappings and Inverse-strongly Monotone Mappings
In this paper, we introduce a general iterative scheme for finding a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of solutions of variational inequalities for an inverse-strongly monotone mapping.
متن کاملLearning Inverse Mappings with Adversarial Criterion
We propose a flipped-Adversarial AutoEncoder (F-AAE) that simultaneously trains a generative model G that maps an arbitrary latent code distribution to a data distribution and an encoder E that embodies an “inverse mapping” that encodes a data sample into a latent code vector. Unlike previous hybrid approaches that leverage adversarial training criterion in constructing autoencoders, F-AAE mini...
متن کاملInverse Limits on Graphs and Montotone Mappings
In 1935, Knaster gave an example of an irreducible continuum (i.e. compact connected metric space) K which can be mapped onto an arc so that each point-preimage is an arc. The continuum K is chainable (or arc-like). In this paper it is shown that every one-dimensional continuum M is a continuous image, with arcs as point-preimages, of some one-dimensional continuum M . Moreover, if M is G-Iike,...
متن کاملConstructing elusive functions with help of evaluation mappings
We introduce a general concept of complexity and a polynomial type algebraic complexity of a polynomial mapping. The notion of polynomial type algebraic complexity encompasses the determinantal complexity. We analyze the relation between polynomial type algebraic complexities and elusive functions. We study geometric-algebraic properties of polynomial type computational complexities. We present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/26/2/526